Moving Least Squares via Orthogonal Polynomials
نویسنده
چکیده
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the moving least squares method caused by particular configurations of nodes in the system. The method is tested by applying it to the estimation of first and second derivatives of test functions on random point distributions. The effect of singular point configurations is illustrated with respect to their effect on the accuracy and convergence of the estimated derivatives.
منابع مشابه
Fast least-squares polynomial approximation in moving time windows
Only a few time series methods are applicable to signal trend analysis under real-time conditions. The use of orthogonal polynomials for least-squares approximations on discrete data turned out to be very e cient for providing estimators in the time domain. A polynomial extrapolation considering signal trends in a certain time window is obtainable even for high sampling rates. The presented met...
متن کاملOn Generalized Moving Least Squares and Diffuse Derivatives
The Moving Least Squares method (MLS) provides an approximation û of a function u based solely on values u(xj) of u on scattered ”meshless” nodes xj . Derivatives of u are usually approximated by derivatives of û. In contrast to this, we directly estimate derivatives of u from the data, without any detour via derivatives of û. This is a generalized Moving Least Squares technique, and we prove t...
متن کاملDiscrete orthogonal polynomials on Gauss-Lobatto Chebyshev nodes
In this paper we present explicit formulas for discrete orthogonal polynomials over the so-called Gauss-Lobatto Chebyshev points. We also give the “three-term recurrence relation” to construct such polynomials. As a numerical application, we apply our formulas to the least-squares problem.
متن کاملConstruction of orthogonal bases for polynomials in Bernstein form on triangular and simplex domains
A scheme for constructing orthogonal systems of bivariate polynomials in the Bernstein–Bézier form over triangular domains is formulated. The orthogonal basis functions have a hierarchical ordering by degree, facilitating computation of least-squares approximations of increasing degree (with permanence of coefficients) until the approximation error is subdued below a prescribed tolerance. The o...
متن کاملLeast squares approximants on Gauss-Lobatto points: orthogonal polynomials and Moore-Penrose pseudo-inverse
Abstract: In this paper we resume some results concerned our work about least-squares approximation on GaussLobatto points. We present explicit formulas for discrete orthogonal polynomials and give the three-term recurrence relation to construct such polynomials. We also show that the normal matrix on this set of nodes can be factorized as the sum of two symmetric matrices: a full rank matrix w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 32 شماره
صفحات -
تاریخ انتشار 2010